Matching and Merging of Ontologies Using Conceptual Graphs

Knowledge management applications need to determine whether two or more knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the same content but differ substantially in form. Previous approaches to this problem have used either syntactic measure or semantic knowledge to determine the distance between two representations. The aim of this article is to define matching of m conceptual graphs and present the mathematical aspects of matching and binding of m conceptual graphs with fitness. The algorithms developed for matching and merging of m conceptual graphs are illustrated.